Non-interactive Multi-client Searchable Symmetric Encryption with Small Client Storage
نویسندگان
چکیده
Considerable attention has been paid to dynamic searchable symmetric encryption (DSSE) which allows users search on dynamically updated encrypted databases. To improve the performance of real-world applications, recent non-interactive multi-client DSSE schemes are targeted at avoiding per-query interaction between data owners and users. However, existing do not consider forward privacy or backward privacy, making them exposed leakage abuse attacks. Besides, most with rely keeping a keyword operation counter an inverted index, resulting in heavy storage burden owner side. address these issues, we propose scheme small client storage, our proposed can provide both privacy. Specifically, first design lightweight chain structure that binds all keywords single state reduce cost. Then, present Hidden Key technique, preserves through time range queries, ensuring newer timestamps cannot match earlier ranges. We conduct extensive experiments validate methods, demonstrate computational efficiency. Moreover, security analysis proves privacy-preserving property methods.
منابع مشابه
An Efficient Non-interactive Multi-client Searchable Encryption with Support for Boolean Queries
Motivated by the recent searchable symmetric encryption protocol of Cash et al., we propose a new multi-client searchable encryption protocol in this work. By tactfully leveraging the RSA-function, our protocol avoids the per-query interaction between the data owner and the client, thus reducing the communication overhead significantly and eliminating the need of the data owner to provide the o...
متن کاملMulti-level Searchable Symmetric Encryption
Remote storage delivers a cost effective solution for data storage. If data is of a sensitive nature, it should be encrypted prior to outsourcing to ensure confidentiality; however, searching then becomes challenging. Searchable encryption is a well-studied solution to this problem. Many schemes only consider the scenario where users can search over the entirety of the encrypted data. In practi...
متن کاملMulti-Client Non-interactive Verifiable Computation
Gennaro et al. (Crypto 2010) introduced the notion of noninteractive verifiable computation, which allows a computationally weak client to outsource the computation of a function f on a series of inputs x, . . . to a more powerful but untrusted server. Following a preprocessing phase (that is carried out only once), the client sends some representation of its current input x to the server; the ...
متن کاملStorage Efficient Substring Searchable Symmetric Encryption
We address the problem of substring searchable encryption. A single user produces a big stream of data and later on wants to learn the positions in the string that some patterns occur. Although current techniques exploit auxiliary data structures to achieve efficient substring search on the server side, the cost at the user side may be prohibitive. We revisit the work of substring searchable en...
متن کاملMulti-level Access in Searchable Symmetric Encryption
Remote storage delivers a cost effective solution for data storage. If data is of a sensitive nature, it should be encrypted prior to outsourcing to ensure confidentiality; however, searching then becomes challenging. Searchable encryption is a well-studied solution to this problem. Many schemes only consider the scenario where users can search over the entirety of the encrypted data. In practi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Services Computing
سال: 2023
ISSN: ['1939-1374', '2372-0204']
DOI: https://doi.org/10.1109/tsc.2023.3301712